On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings

نویسندگان

  • Fukuhito Ooshita
  • Sébastien Tixeuil
چکیده

Self-stabilizing local k-placement of replicas with minimal variance. Self-stabilizing algorithm for maximal graph partitioning into triangles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The cost of probabilistic gathering in oblivious robot networks

In this paper we address the complexity issues of two agreement problems in oblivious robot networks namely gathering and scattering. These abstractions are fundamental coordination problems in cooperative mobile robotics. Moreover, their oblivious characteristics makes them appealing for self-stabilization since they are self-stabilizing with no extra-cost. Given a set of robots with arbitrary...

متن کامل

Gathering Asynchronous Mobile Robots with Inaccurate Compasses

This paper considers a system of asynchronous autonomous mobile robots that can move freely in a two­ dimensional plane with no agreement on a common coordinate system. Startingfrom any initial configuration, the robots are required to eventually gather at a single point, notfixed in advance (gathering problem). Prior work has shown that gathering oblivious (i.e., stateless) robots cannot be ac...

متن کامل

The cost of probabilistic agreement in oblivious robot networks

In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of robots with arbitrary initial locations and no initial agreement on a global coordinate system, gathering requires that all robots reach the exact same but not predetermined location. In contrast, scattering requires tha...

متن کامل

Stabilizing Tiny Interaction Protocols

In this paper we present the self-stabilizing implementation of a class of token based algorithms. In the current work we only consider interactions between weak nodes. They are uniform, they do not have unique identifiers, are static and their interactions are restricted to a subset of nodes called neighbours. While interacting, a pair of neighbouring nodes may create mobile agents (that mater...

متن کامل

Dynamic Modeling and Construction of a New Two-Wheeled Mobile Manipulator: Self-balancing and Climbing

Designing the self-balancing two-wheeled mobile robots and reducing undesired vibrations are of great importance. For this purpose, the majority of researches are focused on application of relatively complex control approaches without improving the robot structure. Therefore, in this paper we introduce a new two-wheeled mobile robot which, despite its relative simple structure, fulfills the req...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012